System for integration and interoperability between disparate distributed server technologies

ABSTRACT

A system for integration and interoperability between disparate distributed server technologies is provided. In particular, the system may provide communications functionality between heterogenous distributed register technology networks. In this regard, the system may establish an interoperability layer between the disparate networks to allow cross-network process flows to be executed. The interoperability layer may comprise one or more network services nodes for each distributed register technology to be integrated by the system. Each network services nodes may act as an event handler for internal processes executed within a given distributed register network and be configured to send and receive data from other network services nodes regarding the execution of such processes. The respective network services may then use the data obtained regarding such internal processes to in turn execute its own processes. In this way, the system may efficiently integrate networks using disparate distributed register technologies.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a non-provisional application of and claims priorityto co-pending U.S. Provisional Patent Application No. 62/971,493 filedFeb. 7, 2020 and titled “SYSTEM FOR INTEGRATION AND INTEROPERABILITYBETWEEN DISPARATE DISTRIBUTED SERVER TECHNOLOGIES”, the entiredisclosure of which is hereby incorporated herein by reference.

FIELD OF THE INVENTION

The present disclosure embraces a system for integration andinteroperability between disparate distributed server technologies.

BACKGROUND

There is a need for an efficient and secure way to establishcommunication channels between servers operating on different protocols.

BRIEF SUMMARY

The following presents a simplified summary of one or more embodimentsof the invention in order to provide a basic understanding of suchembodiments. This summary is not an extensive overview of allcontemplated embodiments, and is intended to neither identify key orcritical elements of all embodiments, nor delineate the scope of any orall embodiments. Its sole purpose is to present some concepts of one ormore embodiments in a simplified form as a prelude to the more detaileddescription that is presented later.

The present disclosure is directed to a system for integration andinteroperability between disparate distributed server technologies. Inparticular, the system may provide communications functionality betweenheterogenous distributed register technology networks. In this regard,the system may establish an interoperability layer between the disparatenetworks to allow cross-network process flows to be executed. Theinteroperability layer may comprise one or more network services nodesfor each distributed register technology to be integrated by the system.Each network services nodes may act as an event handler for internalprocesses executed within a given distributed register network and beconfigured to send and receive data from other network services nodesregarding the execution of such processes. The respective networkservices may then use the data obtained regarding such internalprocesses to in turn execute its own processes. In this way, the systemmay efficiently integrate networks using disparate distributed registertechnologies.

Accordingly, embodiments of the present disclosure provide a system forintegration and interoperability between disparate distributed servertechnologies, the system comprising a memory device withcomputer-readable program code stored thereon; a communication device;and a processing device operatively coupled to the memory device and thecommunication device, wherein the processing device is configured toexecute the computer-readable program code to generate, within a firstdistributed server network, a pending data record comprising a requestto execute a resource transfer; validate the resource transfer via afirst consensus mechanism; append the pending data record to a firstdistributed register implemented on a first distributed registertechnology; and transmit, via a first network services node, informationassociated with the resource transfer to a second network services nodeof a second distributed server network.

In some embodiments, the second network services node is configured toreceive the information associated with the resource transfer; generatea second pending data record comprising the information associated withthe resource transfer; validate the second pending data record via asecond consensus mechanism; and append the second pending data record toa second distributed register implemented on a second distributedregister technology.

In some embodiments, the first distributed register technology isdifferent from the second distributed register technology.

In some embodiments, the second network services node is configured toexecute a smart contract to automatically transmit a notification to thefirst network services node, wherein the notification indicates that thesecond pending data record has been validated by the second networkservices node.

In some embodiments, validating the first pending data record comprisesperforming one or more validation checks on the information associatedwith the resource transfer.

In some embodiments, the one or more validation checks comprisesverification of user information and account information.

Embodiments of the present disclosure also provide a computer programproduct for integration and interoperability between disparatedistributed server technologies, the computer program product comprisingat least one non-transitory computer readable medium havingcomputer-readable program code portions embodied therein, thecomputer-readable program code portions comprising executable codeportions for generating, within a first distributed server network, apending data record comprising a request to execute a resource transfer;validating the resource transfer via a first consensus mechanism;appending the pending data record to a first distributed registerimplemented on a first distributed register technology; andtransmitting, via a first network services node, information associatedwith the resource transfer to a second network services node of a seconddistributed server network.

In some embodiments, the computer-readable program code portions furthercomprise executable code portions for receiving the informationassociated with the resource transfer; generating a second pending datarecord comprising the information associated with the resource transfer;validating the second pending data record via a second consensusmechanism; and appending the second pending data record to a seconddistributed register implemented on a second distributed registertechnology.

In some embodiments, the first distributed register technology isdifferent from the second distributed register technology.

In some embodiments, the second network services node is configured toexecute a smart contract to automatically transmit a notification to thefirst network services node, wherein the notification indicates that thesecond pending data record has been validated by the second networkservices node.

In some embodiments, validating the first pending data record comprisesperforming one or more validation checks on the information associatedwith the resource transfer.

In some embodiments, the one or more validation checks comprisesverification of user information and account information.

Embodiments of the present disclosure also provide acomputer-implemented method for integration and interoperability betweendisparate distributed server technologies, wherein thecomputer-implemented method comprises generating, within a firstdistributed server network, a pending data record comprising a requestto execute a resource transfer; validating the resource transfer via afirst consensus mechanism; appending the pending data record to a firstdistributed register implemented on a first distributed registertechnology; and transmitting, via a first network services node,information associated with the resource transfer to a second networkservices node of a second distributed server network.

In some embodiments, the computer-implemented method further comprisesreceiving the information associated with the resource transfer;generating a second pending data record comprising the informationassociated with the resource transfer; validating the second pendingdata record via a second consensus mechanism; and appending the secondpending data record to a second distributed register implemented on asecond distributed register technology.

In some embodiments, the first distributed register technology isdifferent from the second distributed register technology.

In some embodiments, the second network services node is configured toexecute a smart contract to automatically transmit a notification to thefirst network services node, wherein the notification indicates that thesecond pending data record has been validated by the second networkservices node.

In some embodiments, validating the first pending data record comprisesperforming one or more validation checks on the information associatedwith the resource transfer.

In some embodiments, the one or more validation checks comprisesverification of user information and account information. The features,functions, and advantages that have been discussed may be achievedindependently in various embodiments of the present invention or may becombined with yet other embodiments, further details of which can beseen with reference to the following description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

Having thus described embodiments of the invention in general terms,reference will now be made to the accompanying drawings, wherein:

FIG. 1 illustrates an operating environment for the distributed registerinteroperability system, in accordance with one embodiment of thepresent disclosure;

FIG. 2 is a block diagram illustrating the data structures within anexemplary linked block register, in accordance with one embodiment ofthe present disclosure; and

FIG. 3 illustrates a combination block and flow diagram illustrating thelogical structures and processes of the distributed registerinteroperability system, in accordance with one embodiment of thepresent disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Embodiments of the present invention will now be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all, embodiments of the invention are shown. Indeed, theinvention may be embodied in many different forms and should not beconstrued as limited to the embodiments set forth herein; rather, theseembodiments are provided so that this disclosure will satisfy applicablelegal requirements. Like numbers refer to elements throughout. Wherepossible, any terms expressed in the singular form herein are meant toalso include the plural form and vice versa, unless explicitly statedotherwise. Also, as used herein, the term “a” and/or “an” shall mean“one or more,” even though the phrase “one or more” is also used herein.

“Entity” as used herein may refer to an individual or an organizationthat owns and/or operates an online system of networked computingdevices, systems, and/or peripheral devices on which the systemdescribed herein is implemented. The entity may be a businessorganization such as a financial institution, a non-profit organization,a government organization, and the like, which may routinely use varioustypes of applications within its enterprise environment to accomplishits organizational objectives.

“Entity system” as used herein may refer to the computing systems,devices, software, applications, communications hardware, and/or otherresources used by the entity to perform the functions as describedherein. Accordingly, the entity system may comprise desktop computers,laptop computers, servers, Internet-of-Things (“IoT”) devices, networkedterminals, mobile smartphones, smart devices (e.g., smart watches),network connections, and/or other types of computing systems or devicesand/or peripherals along with their associated applications.

“Computing system” or “computing device” as used herein may refer to anetworked computing device within the entity system. The computingsystem may include a processor, a non-transitory storage medium, acommunications device, and a display. The computing system may beconfigured to support user logins and inputs from any combination ofsimilar or disparate devices. Accordingly, the computing system may be aportable electronic device such as a smartphone, tablet, single boardcomputer, smart device, or laptop. In other embodiments, the computingsystem may be a stationary unit such as a personal desktop computer,networked terminal, IoT device, or the like.

“User” as used herein may refer to an individual who may interact withthe entity system to access the functions therein. Accordingly, the usermay be an agent, employee, associate, contractor, or other authorizedparty who may access, use, administrate, maintain, and/or manage thecomputing systems within the entity system. In other embodiments, theuser may be a client or customer of the entity.

Accordingly, as used herein the term “user device” or “mobile device”may refer to mobile phones, personal computing devices, tabletcomputers, wearable devices, and/or any portable electronic devicecapable of receiving and/or storing data therein.

“Distributed register,” or “distributed ledger” as used herein may referto a structured list of data records that is decentralized anddistributed amongst a plurality of computing systems and/or devices. Insome embodiments, the distributed register may be a linked blockregister.

“Linked block structure” as used herein may refer to a data structurewhich may comprise a series of sequentially linked “blocks,” where eachblock may comprise data and metadata. The “data” within each block maycomprise one or more “data record” or “transactions,” while the“metadata” within each block may comprise information about the block,which may include a timestamp, a hash value of data records within theblock, and a pointer (e.g., a hash value) to the previous block in thelinked block register. In this way, beginning from an originating block(e.g., a “genesis block”), each block in the linked block structure islinked to another block via the pointers within the block headers. Ifthe data or metadata within a particular block in the linked blockregister becomes corrupted or modified, the hash values found in theheader of the affected block and/or the downstream blocks may becomemismatched, thus allowing the system to detect that the data has beencorrupted or modified. In some embodiments, the linked block structuremay be a blockchain data structure.

A “linked block register” may refer to a distributed register which useslinked block data structures. Generally, a linked block register is an“append only” ledger in which the data within each block within thelinked block register may not be modified after the block is added tothe linked block register; data may only be added in a new block to theend of the linked block register. In this way, the linked block registermay provide a practically immutable ledger of data records over time.

“Permissioned linked block register” as used herein may refer to alinked block register for which an access control mechanism isimplemented such that only known, authorized users may take certainactions with respect to the linked block register (e.g., add new datarecords, participate in the consensus mechanism, or the like).Accordingly, “unpermissioned linked block register” as used herein mayrefer to a linked block register without an access control mechanism.

“Private linked block register” as used herein may refer to a linkedblock register accessible only to users or devices that meet specificcriteria (e.g., authorized users or devices of a certain entity or otherorganization). Accordingly, a “public linked block register” is a linkedblock register accessible by any member or device in the public realm.

“Node” as used herein may refer to a computing system on which thedistributed register is hosted. In some embodiments, each node maintainsa full copy of the distributed register. In this way, even if one ormore nodes become unavailable or offline, a full copy of the distributedregister may still be accessed via the remaining nodes in thedistributed register system. That said, in some embodiments, the nodesmay host a hybrid linked block register such that certain nodes maystore certain segments of the linked block register but not others.

“Consensus,” “consensus algorithm,” or “consensus mechanism” as usedherein may refer to the process or processes by which nodes come to anagreement with respect to the contents of the distributed register.Changes to the ledger (e.g., addition of data records) may requireconsensus to be reached by the nodes in order to become a part of theauthentic version of the ledger. In this way, the consensus mechanismmay ensure that each node maintains a copy of the distributed registerthat is consistent with the copies of the distributed register hosted onthe other nodes; if the copy of the distributed register hosted on onenode becomes corrupted or compromised, the remaining nodes may use theconsensus algorithm to determine the “true” version of the distributedregister. The nodes may use various different mechanisms or algorithmsto obtain consensus, such as proof-of-work (“PoW”), proof-of-stake(“PoS”), practical byzantine fault tolerance (“PBFT”),proof-of-authority (“PoA”), or the like.

“Smart contract” as used herein may refer to executable computer code orlogic that may be executed according to an agreement between partiesupon the occurrence of a condition precedent (e.g., a triggering eventsuch as the receipt of a proposed data record). In some embodiments, thesmart contract may be self-executing code that is stored in thedistributed register, where the self-executing code may be executed whenthe condition precedent is detected by the system on which the smartcontract is stored.

Embodiments of the present disclosure provide a system for integrationand interoperability between disparate distributed server technologies.Accordingly, the system may comprise one or more networked computingsystems which may host ledgers which may be implemented on variousdifferent types of distributed server or distributed ledger technology(“DLT”) networks. The system may comprise a first DLT network comprisingone or more nodes, where the one or more nodes may comprise a networkservices node. The network services node of the first DLT network mayinclude an event handler function which tracks the processes executedwithin the first DLT network (e.g., execution of transactions,consensus/data record validation, and the like). The network servicesnode of the first DLT network may further be in operative communicationwith a network services node of a second DLT network, which may includean event handler function that tracks processes executed within thesecond DLT network. The second DLT network may be separate andindependent from the first DLT network such that the nodes of the firstDLT network may not be communicatively compatible with the nodes of thesecond DLT network, except for the respective network services nodes.Accordingly, the network services node of the first DLT network may,together with the network services node of the second DLT network, forman interoperability layer between the first DLT network and the secondDLT network. By establishing back-and-forth communication compatibilitybetween the network services nodes, the system may allow for thecoordination and execution of processes across disparate, formerlyincompatible DLT networks.

An exemplary use case is provided as follows for illustrative purposes.A first set of entities (e.g., financial institutions) may each ownand/or operate a node which hosts a distributed register implementedusing a first distributed register technology (e.g., a first DLTnetwork), and a second set of entities may each own and/or operate anode which hosts a distributed register implemented using a seconddistributed register technology (e.g., a second DLT network). Therespective DLT networks may store various types of information regardingthe processes of the entities that make up the DLT networks. Forinstance, the first DLT network may comprise information associated withone or more entities within the first set of entities such astransaction data (obligations, settlements, balances, and the like),account information, client information, consensus outcomes, and thelike. Likewise, the second DLT network may comprise such informationassociated with one or more entities within the second set of entities.

In such a scenario, the nodes of the first DLT network may not be ableto directly read the information hosted within the second DLT network,and conversely, the nodes of the second DLT network may not be able todirectly read the information hosted within the first DLT network, asthe first DLT network and second DLT network may use differentdistributed register technologies (e.g., different data structures,consensus mechanisms, encryption requirements, smart contracts,protocols, and the like). Accordingly, the first DLT network maycomprise a network services node which tracks the information andprocesses within the first DLT network. The network services node of thefirst DLT network may be configured to be compatible with the nodes ofthe first DLT network (and the distributed register hosted thereon) aswell as a network service node of the second DLT network, which may beconfigured to be compatible with the nodes of the second DLT network(and the distributed register hosted hereon). In such a configuration,the network services node of the first DLT network may be able to sendreports regarding the information and processes within the first DLTnetwork to a network services node of the second DLT network. Thus, thenetwork services nodes of the first DLT network and second DLT networkmay form an interoperability layer between the two DLT networks. Theinteractions between the network services nodes may be automaticallyexecuted via smart contracts implemented on each of the DLT networksusing the respective distributed register technologies and/or platforms.

In an exemplary embodiment, a client of an entity within the first setof entities (e.g., a first entity) may wish to execute a transaction(e.g., a transfer of resources) to a client of an entity within thesecond set of entities (e.g., a second entity). The first entity's nodemay submit a request to append a data record to the distributed registerhosted on the first DLT network, where the data record comprises theinformation needed to complete the transaction (e.g., account balance,account information, recipient information, and the like). The nodeswithin the first DLT network may perform validation checks on theproposed data record as part of the consensus mechanism of the first DLTnetwork (e.g., verify that the account and account holder informationare correct for both the sender and recipient, verify that the accounthas enough resources to execute the transaction, and the like). Once theproposed data record has been validated, the proposed data record may beappended to the distributed register. Meanwhile, the network servicesnode of the first DLT network may transmit a signal to the networkservices node of the second DLT network, where the signal may comprisethe information associated with the transaction. The network servicesnode of the second DLT network may distribute the information to theother nodes of the second DLT network, which may subsequently, based onthe information, automatically execute processes to complete thetransaction (e.g., perform clearing, update account balances, and thelike).

Turning now to the figures, FIG. 1 illustrates an operating environment100 for the distributed register interoperability system, in accordancewith one embodiment of the present disclosure. In particular, FIG. 1illustrates a first DLT network node 101 and a second DLT network node102. The first DLT network node 101 may be a part of a first DLT network103, where each node within the first DLT network 103 maintains a copyof a first distributed register 122. Likewise, the second DLT networknode 102 may be a part of a second DLT network 104, where each nodewithin the second DLT network 104 maintains a copy of a seconddistributed register 142. In some embodiments, the first DLT networknode 101 may be communicatively coupled to the second DLT network node102. In such embodiments, the first DLT network node 101 may be anetwork services node of the first DLT network 103, and the second DLTnetwork node 102 may be a network services node of the second DLTnetwork 104. It should be understood that FIG. 1 illustrates only anexemplary embodiment of the operating environment 100, and it will beappreciated that one or more functions of the systems, devices, orservers as depicted in FIG. 1 may be combined into a single system,device, or server. Furthermore, a single system, device, or server asdepicted in FIG. 1 may represent multiple systems, devices, or servers.For instance, though FIG. 1 depicts a single first DLT network node 101and a single second DLT network node 102, the operating environment maycomprise multiple first DLT network nodes 101 and/or multiple second DLTnetwork nodes 102.

The network may be a system specific distributive network receiving anddistributing specific network feeds and identifying specific networkassociated triggers. The network include one or more cellular radiotowers, antennae, cell sites, base stations, telephone networks, cloudnetworks, radio access networks (RAN), WiFi networks, or the like.Additionally, the network may also include a global area network (GAN),such as the Internet, a wide area network (WAN), a local area network(LAN), or any other type of network or combination of networks.Accordingly, the network may provide for wireline, wireless, or acombination wireline and wireless communication between devices on thenetwork.

As illustrated in FIG. 1, the first DLT network node 101 may be a partof the first DLT network 103. In this regard, the first DLT network node101 may be, for example, a networked terminal, server, desktop computer,or the like, though it is within the scope of the disclosure for thefirst DLT network node 101 to be a portable device such as a cellularphone, smart phone, smart device, personal data assistant (PDA), laptop,or the like. The first DLT network node 101 may comprise a communicationdevice 112, a processing device 114, and a memory device 116, where theprocessing device 114 is operatively coupled to the communication device112 and the memory device 116. The processing device 114 uses thecommunication device 112 to communicate with the network and otherdevices on the network. As such, the communication device 112 generallycomprises a modem, antennae, WiFi or Ethernet adapter, radiotransceiver, or other device for communicating with other devices on thenetwork.

The memory device 116 comprises computer-readable instructions 120 anddata storage 118, where the data storage 118 may comprise a copy of thefirst distributed register 122. The first distributed register (and thecopy of the first distributed register 122) may comprise a series ofdata records relevant to the objectives of an entity associated with thefirst DLT network 103. For instance, the first distributed register maycomprise a series of data records containing data regarding processes ortransactions related to such entity, as described elsewhere herein. Thecomputer-readable instructions 120 may have a first DLT application 124stored thereon, where the first DLT application 124 which may track theinformation and/or processes within the first distributed register. Thefirst DLT application 124 may further be configured to send and receiveinformation to and from the second DLT network node 102.

As further illustrated in FIG. 1, the second DLT network node 102 may bea part of the second DLT network 104 and comprise a communication device132, a processing device 134, and a memory device 136. As used herein,the term “processing device” generally includes circuitry used forimplementing the communication and/or logic functions of the particularsystem. For example, a processing device may include a digital signalprocessor device, a microprocessor device, and various analog-to-digitalconverters, digital-to-analog converters, and other support circuitsand/or combinations of the foregoing. Control and signal processingfunctions of the system are allocated between these processing devicesaccording to their respective capabilities. The processing device mayinclude functionality to operate one or more software programs based oncomputer-readable instructions thereof, which may be stored in a memorydevice.

The communication device 132, and other communication devices asdescribed herein, may comprise a wireless local area network (WLAN) suchas WiFi based on the Institute of Electrical and Electronics Engineers'(IEEE) 802.11 standards, Bluetooth short-wavelength UHF radio waves inthe ISM band from 2.4 to 2.485 GHz or other wireless access technology.Alternatively or in addition to the wireless interface, the systemsdescribed herein may also include a communication interface device thatmay be connected by a hardwire connection to the resource distributiondevice. The interface device may comprise a connector such as a USB,SATA, PATA, SAS or other data connector for transmitting data to andfrom the respective computing system.

The processing device 134 is operatively coupled to the communicationdevice 132 and the memory device 136. The processing device 134 uses thecommunication device 132 to communicate with the network and otherdevices on the network, such as, but not limited to the first DLTnetwork node 101. The communication device 132 generally comprises amodem, antennae, WiFi or Ethernet adapter, radio transceiver, or otherdevice for communicating with other devices on the network.

In some embodiments, the memory device 136 may further include datastorage 138 which may comprise a copy of the second distributed register142. The second distributed register may contain various types ofinformation relating to an entity associated with the second DLT network104. The memory device 136 may have computer-readable instructions 140stored thereon, which may further comprise a second DLT application 144.The second DLT application 144 may allow the second DLT network node 102to send and receive information to and from the first DLT network node101.

The communication devices as described herein may comprise a wirelesslocal area network (WLAN) such as WiFi based on the Institute ofElectrical and Electronics Engineers' (IEEE) 802.11 standards, Bluetoothshort-wavelength UHF radio waves in the ISM band from 2.4 to 2.485 GHzor other wireless access technology. Alternatively or in addition to thewireless interface, the client node 104 may also include a communicationinterface device that may be connected by a hardwire connection to theresource distribution device. The interface device may comprise aconnector such as a USB, SATA, PATA, SAS or other data connector fortransmitting data to and from the respective computing system.

The computing systems described herein may each further include aprocessing device communicably coupled to devices as a memory device,output devices, input devices, a network interface, a power source, aclock or other timer, a camera, a positioning system device, agyroscopic device, one or more chips, and the like.

In some embodiments, the computing systems may access one or moredatabases or datastores (not shown) to search for and/or retrieveinformation related to the service provided by the entity. The computingsystems may also access a memory and/or datastore local to the variouscomputing systems within the operating environment 100.

The processing devices as described herein may include functionality tooperate one or more software programs or applications, which may bestored in the memory device. For example, a processing device may becapable of operating a connectivity program, such as a web browserapplication. In this way, the computing systems may transmit and receiveweb content, such as, for example, product valuation, serviceagreements, location-based content, and/or other web page content,according to a Wireless Application Protocol (WAP), Hypertext TransferProtocol (HTTP), and/or the like.

A processing device may also be capable of operating applications. Theapplications may be downloaded from a server and stored in the memorydevice of the computing systems. Alternatively, the applications may bepre-installed and stored in a memory in a chip.

The chip may include the necessary circuitry to provide integrationwithin the devices depicted herein. Generally, the chip will includedata storage which may include data associated with the service that thecomputing systems may be communicably associated therewith. The chipand/or data storage may be an integrated circuit, a microprocessor, asystem-on-a-chip, a microcontroller, or the like. In this way, the chipmay include data storage. Of note, it will be apparent to those skilledin the art that the chip functionality may be incorporated within otherelements in the devices. For instance, the functionality of the chip maybe incorporated within the memory device and/or the processing device.In a particular embodiment, the functionality of the chip isincorporated in an element within the devices. Still further, the chipfunctionality may be included in a removable storage device such as anSD card or the like.

A processing device may be configured to use the network interface tocommunicate with one or more other devices on a network. In this regard,the network interface may include an antenna operatively coupled to atransmitter and a receiver (together a “transceiver”). The processingdevice may be configured to provide signals to and receive signals fromthe transmitter and receiver, respectively. The signals may includesignaling information in accordance with the air interface standard ofthe applicable cellular system of the wireless telephone network thatmay be part of the network. In this regard, the computing systems may beconfigured to operate with one or more air interface standards,communication protocols, modulation types, and access types. By way ofillustration, the devices may be configured to operate in accordancewith any of a number of first, second, third, fourth, and/orfifth-generation communication protocols and/or the like. For example,the computing systems may be configured to operate in accordance withsecond-generation (2G) wireless communication protocols IS-136 (timedivision multiple access (TDMA)), GSM (global system for mobilecommunication), and/or IS-95 (code division multiple access (CDMA)), orwith third-generation (3G) wireless communication protocols, such asUniversal Mobile Telecommunications System (UMTS), CDMA2000, widebandCDMA (WCDMA) and/or time division-synchronous CDMA (TD-SCDMA), withfourth-generation (4G) wireless communication protocols, withfifth-generation (5G) wireless communication protocols, or the like. Thedevices may also be configured to operate in accordance withnon-cellular communication mechanisms, such as via a wireless local areanetwork (WLAN) or other communication/data networks.

The network interface may also include an application interface in orderto allow a user or service provider to execute some or all of theabove-described processes. The application interface may have access tothe hardware, e.g., the transceiver, and software previously describedwith respect to the network interface. Furthermore, the applicationinterface may have the ability to connect to and communicate with anexternal data storage on a separate system within the network.

The devices may have an interface that includes user output devicesand/or input devices. The output devices may include a display (e.g., aliquid crystal display (LCD) or the like) and a speaker or other audiodevice, which are operatively coupled to the processing device. Theinput devices, which may allow the devices to receive data from a user,may include any of a number of devices allowing the devices to receivedata from a user, such as a keypad, keyboard, touch-screen, touchpad,microphone, mouse, joystick, other pointer device, button, soft key,and/or other input device(s).

The devices may further include a power source. Generally, the powersource is a device that supplies electrical energy to an electricalload. In some embodiment, power source may convert a form of energy suchas solar energy, chemical energy, mechanical energy, or the like toelectrical energy. Generally, the power source may be a battery, such asa lithium battery, a nickel-metal hydride battery, or the like, that isused for powering various circuits, e.g., the transceiver circuit, andother devices that are used to operate the devices. Alternatively, thepower source may be a power adapter that can connect a power supply froma power outlet to the devices. In such embodiments, a power adapter maybe classified as a power source “in” the devices.

As described above, the computing devices as shown in FIG. 1 may alsoinclude a memory device operatively coupled to the processing device. Asused herein, “memory” may include any computer readable mediumconfigured to store data, code, or other information. The memory devicemay include volatile memory, such as volatile Random Access Memory (RAM)including a cache area for the temporary storage of data. The memorydevice may also include non-volatile memory, which can be embeddedand/or may be removable. The non-volatile memory may additionally oralternatively include an electrically erasable programmable read-onlymemory (EEPROM), flash memory or the like.

The memory device may store any of a number of applications or programswhich comprise computer-executable instructions/code executed by theprocessing device to implement the functions of the devices describedherein.

The computing systems may further comprise a gyroscopic device. Thepositioning system, input device, and the gyroscopic device may be usedin correlation to identify phases within a service term.

Each computing system may also have a control system for controlling thephysical operation of the device. The control system may comprise one ormore sensors for detecting operating conditions of the variousmechanical and electrical systems that comprise the computing systems orof the environment in which the computing systems are used. The sensorsmay communicate with the processing device to provide feedback to theoperating systems of the device. The control system may also comprisemetering devices for measuring performance characteristics of thecomputing systems. The control system may also comprise controllers suchas programmable logic controllers (PLC), proportional integralderivative controllers (PID) or other machine controllers. The computingsystems may also comprise various electrical, mechanical, hydraulic orother systems that perform various functions of the computing systems.These systems may comprise, for example, electrical circuits, motors,compressors, or any system that enables functioning of the computingsystems.

FIG. 2 is a block diagram illustrating the data structures within anexemplary linked block register, in accordance with some embodiments. Inparticular, FIG. 2 depicts a plurality of blocks 200, 201 within thelinked block register 122, in addition to a pending block 202 that hasbeen submitted to be appended to the linked block register 122. Thelinked block register 122 may comprise a genesis block 200 that servesas the first block and origin for subsequent blocks in the linked blockregister 122. The genesis block 200, like all other blocks within thelinked block register 122, comprise a block header 201 and block data209. The genesis block data 209, or any other instances of block datawithin the linked block register 122 (or any other distributed register)may contain one or more data records. For instance, block data maycomprise software source code, authentication data, transaction data,documents or other data containers, third party information, regulatoryand/or legal data, or the like.

The genesis block header 201 may comprise various types of metadataregarding the genesis block data 209. In some embodiments, the blockheader 201 may comprise a genesis block root hash 203, which is a hashderived from an algorithm using the genesis block data 209 as inputs. Insome embodiments, the genesis block root hash 203 may be a Merkle roothash, wherein the genesis block root hash 203 is calculated via a hashalgorithm based on a combination of the hashes of each data recordwithin the genesis block data 209. In this way, any changes to the datawithin the genesis block data 209 will result in a change in the genesisblock root hash 203. The genesis block header 201 may further comprise agenesis block timestamp 204 that indicates the time at which the blockwas written to the linked block register 122. In some embodiments, thetimestamp may be a Unix timestamp. In some embodiments, particularly inlinked block registers utilizing a PoW consensus mechanism, the blockheader 201 may comprise a nonce value and a difficulty value. The noncevalue may be a whole number value that, when combined with the otheritems of metadata within the block header 201 into a hash algorithm,produces a hash output that satisfies the difficulty level of thecryptographic puzzle as defined by the difficulty value. For instance,the consensus mechanism may require that the resulting hash of the blockheader 201 falls below a certain value threshold (e.g., the hash valuemust start with a certain number of zeroes, as defined by the difficultyvalue).

A subsequent block 201 may be appended to the genesis block 200 to serveas the next block in the linked block register. Like all other blocks,the subsequent block 201 comprises a block header 211 and block data219. Similarly, the block header 211 comprise a block root hash 213 ofthe data within the block data 219 and a block timestamp 214. The blockheader 211 may further comprise a previous block pointer 212, which maybe a hash calculated by combining the hashes of the metadata (e.g., thegenesis block root hash 203, genesis block timestamp 204, and the like)within the block header 201 of the genesis block 200. In this way, theblock pointer 212 may be used to identify the previous block (e.g., thegenesis block 200) in the linked block register 122, thereby creating a“chain” comprising the genesis block 200 and the subsequent block 201.

The value of a previous block pointer is dependent on the hashes of theblock headers of all of the previous blocks in the chain; if the blockdata within any of the blocks is altered, the block header for thealtered block as well as all subsequent blocks will result in differenthash values. In other words, the hash in the block header may not matchthe hash of the values within the block data, which may cause subsequentvalidation checks to fail. Even if an unauthorized user were to changethe block header hash to reflect the altered block data, this would inturn change the hash values of the previous block pointers of the nextblock in the sequence. Therefore, an unauthorized user who wishes toalter a data record within a particular block must also alter the hashesof all of the subsequent blocks in the chain in order for the alteredcopy of the linked block register to pass the validation checks imposedby the consensus algorithm. Thus, the computational impracticability ofaltering data records in a linked block register in turn greatly reducesthe probability of improper alteration of data records.

A pending block 202 or “proposed block” may be submitted for addition tothe linked block register 122. The pending block 202 may comprise apending block header 221, which may comprise a pending block root hash223, a previous block pointer 222 that points to the previous block 201,a pending block timestamp 224, and pending block data 229. Once apending block 202 is submitted to the system, the nodes within thesystem may validate the pending block 202 via a consensus algorithm. Theconsensus algorithm may be, for instance, a proof of work mechanism, inwhich a node determines a nonce value that, when combined with a hash ofthe block header 211 of the last block in the linked block register,produces a hash value that falls under a specified threshold value. Forinstance, the PoW algorithm may require that said hash value begins witha certain number of zeroes. Once said nonce value is determined by oneof the nodes in the linked block register, the node may post the“solution” to the other nodes in the linked block register. Once thesolution is validated by the other nodes, the hash of the block header211 is included in the pending block header 221 of the pending block 202as the previous block pointer 222. The pending block header 221 mayfurther comprise the pending block root hash 223 of the pending blockdata 229 which may be calculated based on the winning solution. Thepending block 202 is subsequently considered to be appended to theprevious block 201 and becomes a part of the linked block register 122.A pending block timestamp 224 may also be added to signify the time atwhich the pending block 202 is added to the linked block register 122.

In other embodiments, the consensus mechanism may be based on a totalnumber of consensus inputs submitted by the nodes of the linked blockregister 122, e.g., a PBFT consensus mechanism. Once a threshold numberof consensus inputs to validate the pending block 202 has been reached,the pending block 202 may be appended to the linked block register 122.In such embodiments, nonce values and difficulty values may be absentfrom the block headers. In still other embodiments, the consensusalgorithm may be a Proof-of-Stake mechanism in which the stake (e.g.,amount of digital currency, reputation value, or the like) may influencethe degree to which the node may participate in consensus and select thenext proposed block. In other embodiments, the consensus algorithm maybe a Proof-of-Authority mechanism in which the identity of the validatoritself (with an attached reputation value) may be used to validateproposed data records (e.g., the ability to participate inconsensus/approval of proposed data records may be limited to approvedand/or authorized validator nodes). In yet other embodiments, theconsensus algorithm may comprise a manual node approval process ratherthan an automated process.

FIG. 3 is a combination block and process flow 300 diagram for thedistributed register interoperability system, in accordance with oneembodiment of the present disclosure. The process begins within thefirst DLT network 103 at block 301, where the system generates a pendingdata record comprising a request to execute a resource transfer. In suchan embodiment, the pending data record may comprise information such asuser information/identity, account information, account balance,recipient account information, transaction parameters (e.g., transactionamount, timeframe, and the like), and the like. The request to execute aresource transfer may be, for instance, a transaction request from aclient of an entity within the first DLT network 103 to a client of anentity within the second DLT network 104. In some embodiments, the firstdistributed register of the first DLT network 103 may be implementedusing a different distributed register technology from that of thesecond distributed register of the second DLT network 104. Accordingly,the system may provide automated interaction and settlement capabilitiesbetween the two heterogeneous distributed registers.

The process continues to block 302, where the system validates theresource transfer via a first consensus mechanism. The first consensusmechanism may be unique to the first DLT network 103, and may compriseone or more validation checks on the pending data record. In thisregard, the one or more validation checks may be performed as part of anobligation/settlement process. For example, the one or more validationchecks may comprise verifying that the user and/or account informationis valid (e.g., the identity of the user matches the accountinformation), the verification of account balances, timeframevalidation, and the like. In some embodiments, the first DLT network 103may comprise a notary node which performs additional functions as partof the first consensus mechanism. In such embodiments, the system mayrequire the pending data record to be notarized by the notary nodewithin a specified timeframe in order to be validated. The notary nodemay additionally reject a transaction if a double spend is attempted.

The process continues to block 303, where the system appends the pendingdata record to the first distributed register. At this stage, the systemmay consider the pending data record to be a permanent part of the firstdistributed register. The register balance may then be updated anddisplayed to a user (e.g., the client of the entity, an employee of theentity, and the like).

The process continues to block 304, where the system transmits thetransaction information via a first network services node. The firstnetwork services node, as a part of the first DLT network 103, may beconfigured to read the data records within the first distributedregister. In this regard, the first distributed register may comprise asmart contract configured to automatically transmit the informationassociated with the resource transfer (e.g., transaction information) toa second network services node once the pending data record has beenvalidated and appended to the first distributed register. The firstnetwork services node and second network services node may form aninteroperability layer 350 which allows for real-time or near real-timesettlement of transactions across otherwise incompatible distributedregister technologies.

The process continues to block 305 within the second DLT network 104,where the system receives the transaction information via a secondnetwork services node. The second network services node, as a part ofthe second DLT network 104, may be configured to read the data recordswithin the second distributed register. In this regard, the secondnetwork services node may make the transaction information available tothe remaining nodes within the second DLT network 104.

The process continues to block 306, where the system generates a secondpending data record comprising the transaction information. In someembodiments, the second pending data record may be proposed by thesecond network services node. For instance, the second distributedregister may comprise a smart contract which causes the second networkservices node to automatically generate the second pending data recordupon receiving the transaction information from the first networkservices node.

The process continues to block 307, where the system validates thesecond pending data record via a second consensus mechanism. Based onthe transaction information within the second pending data record, thenodes of the second DLT network 104 may perform their own settlementprocesses to validate the transaction (e.g., verifying user/accountinformation, transaction amounts, timeframes, account balances, and thelike).

The process concludes at block 308, where the system appends the secondpending data record to the second distributed register. At this stage,the system may consider the second pending data record to be a permanentpart of the second distributed register. The account balances of therecipient may be updated in the manner described herein and displayed toa second user (e.g., the recipient, an entity of the second DLT network104, and the like). In some embodiments, the smart contract may furthercause the second network services node to automatically transmit anotification to the first network services node, where the notificationindicates that the second pending data record has been successfullyvalidated. In this way, the system may provide interoperability betweendisparate, heterogenous DLT networks and allow cross-network process andtransactions to be executed efficiently and automatically.

As will be appreciated by one of ordinary skill in the art, the presentinvention may be embodied as an apparatus (including, for example, asystem, a machine, a device, a computer program product, and/or thelike), as a method (including, for example, a business process, acomputer-implemented process, and/or the like), or as any combination ofthe foregoing. Accordingly, embodiments of the present invention maytake the form of an entirely software embodiment (including firmware,resident software, micro-code, and the like), an entirely hardwareembodiment, or an embodiment combining software and hardware aspectsthat may generally be referred to herein as a “system.” Furthermore,embodiments of the present invention may take the form of a computerprogram product that includes a computer-readable storage medium havingcomputer-executable program code portions stored therein.

As the phrase is used herein, a processor may be “configured to” performa certain function in a variety of ways, including, for example, byhaving one or more general-purpose circuits perform the function byexecuting particular computer-executable program code embodied incomputer-readable medium, and/or by having one or moreapplication-specific circuits perform the function.

It will be understood that any suitable computer-readable medium may beutilized. The computer-readable medium may include, but is not limitedto, a non-transitory computer-readable medium, such as a tangibleelectronic, magnetic, optical, infrared, electromagnetic, and/orsemiconductor system, apparatus, and/or device. For example, in someembodiments, the non-transitory computer-readable medium includes atangible medium such as a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EEPROM or Flash memory), a compact discread-only memory (CD-ROM), and/or some other tangible optical and/ormagnetic storage device. In other embodiments of the present invention,however, the computer-readable medium may be transitory, such as apropagation signal including computer-executable program code portionsembodied therein.

It will also be understood that one or more computer-executable programcode portions for carrying out the specialized operations of the presentinvention may be required on the specialized computer includeobject-oriented, scripted, and/or unscripted programming languages, suchas, for example, Java, Perl, Smalltalk, C++, SAS, SQL, Python, ObjectiveC, and/or the like. In some embodiments, the one or morecomputer-executable program code portions for carrying out operations ofembodiments of the present invention are written in conventionalprocedural programming languages, such as the “C” programming languagesand/or similar programming languages. The computer program code mayalternatively or additionally be written in one or more multi-paradigmprogramming languages, such as, for example, F#.

Embodiments of the present invention are described above with referenceto flowcharts and/or block diagrams. It will be understood that steps ofthe processes described herein may be performed in orders different thanthose illustrated in the flowcharts. In other words, the processesrepresented by the blocks of a flowchart may, in some embodiments, be inperformed in an order other that the order illustrated, may be combinedor divided, or may be performed simultaneously. It will also beunderstood that the blocks of the block diagrams illustrated, in someembodiments, merely conceptual delineations between systems and one ormore of the systems illustrated by a block in the block diagrams may becombined or share hardware and/or software with another one or more ofthe systems illustrated by a block in the block diagrams. Likewise, adevice, system, apparatus, and/or the like may be made up of one or moredevices, systems, apparatuses, and/or the like. For example, where aprocessor is illustrated or described herein, the processor may be madeup of a plurality of microprocessors or other processing devices whichmay or may not be coupled to one another. Likewise, where a memory isillustrated or described herein, the memory may be made up of aplurality of memory devices which may or may not be coupled to oneanother.

It will also be understood that the one or more computer-executableprogram code portions may be stored in a transitory or non-transitorycomputer-readable medium (e.g., a memory, and the like) that can directa computer and/or other programmable data processing apparatus tofunction in a particular manner, such that the computer-executableprogram code portions stored in the computer-readable medium produce anarticle of manufacture, including instruction mechanisms which implementthe steps and/or functions specified in the flowchart(s) and/or blockdiagram block(s).

The one or more computer-executable program code portions may also beloaded onto a computer and/or other programmable data processingapparatus to cause a series of operational steps to be performed on thecomputer and/or other programmable apparatus. In some embodiments, thisproduces a computer-implemented process such that the one or morecomputer-executable program code portions which execute on the computerand/or other programmable apparatus provide operational steps toimplement the steps specified in the flowchart(s) and/or the functionsspecified in the block diagram block(s). Alternatively,computer-implemented steps may be combined with operator and/orhuman-implemented steps in order to carry out an embodiment of thepresent invention.

While certain exemplary embodiments have been described and shown in theaccompanying drawings, it is to be understood that such embodiments aremerely illustrative of, and not restrictive on, the broad invention, andthat this invention not be limited to the specific constructions andarrangements shown and described, since various other changes,combinations, omissions, modifications and substitutions, in addition tothose set forth in the above paragraphs, are possible. Those skilled inthe art will appreciate that various adaptations and modifications ofthe just described embodiments can be configured without departing fromthe scope and spirit of the invention. Therefore, it is to be understoodthat, within the scope of the appended claims, the invention may bepracticed other than as specifically described herein.

What is claimed is:
 1. A system for integration and interoperabilitybetween disparate distributed server technologies, the systemcomprising: a memory device with computer-readable program code storedthereon; a communication device; and a processing device operativelycoupled to the memory device and the communication device, wherein theprocessing device is configured to execute the computer-readable programcode to: generate, within a first distributed server network, a pendingdata record comprising a request to execute a resource transfer;validate the resource transfer via a first consensus mechanism; appendthe pending data record to a first distributed register implemented on afirst distributed register technology; and transmit, via a first networkservices node, information associated with the resource transfer to asecond network services node of a second distributed server network. 2.The system according to claim 1, wherein the second network servicesnode is configured to: receive the information associated with theresource transfer; generate a second pending data record comprising theinformation associated with the resource transfer; validate the secondpending data record via a second consensus mechanism; and append thesecond pending data record to a second distributed register implementedon a second distributed register technology.
 3. The system according toclaim 2, wherein the first distributed register technology is differentfrom the second distributed register technology.
 4. The system accordingto claim 2, wherein the second network services node is configured toexecute a smart contract to automatically transmit a notification to thefirst network services node, wherein the notification indicates that thesecond pending data record has been validated by the second networkservices node.
 5. The system according to claim 1, wherein validatingthe first pending data record comprises performing one or morevalidation checks on the information associated with the resourcetransfer.
 6. The system according to claim 5, wherein the one or morevalidation checks comprises verification of user information and accountinformation.
 7. A computer program product for integration andinteroperability between disparate distributed server technologies, thecomputer program product comprising at least one non-transitory computerreadable medium having computer-readable program code portions embodiedtherein, the computer-readable program code portions comprisingexecutable code portions for: generating, within a first distributedserver network, a pending data record comprising a request to execute aresource transfer; validating the resource transfer via a firstconsensus mechanism; appending the pending data record to a firstdistributed register implemented on a first distributed registertechnology; and transmitting, via a first network services node,information associated with the resource transfer to a second networkservices node of a second distributed server network.
 8. The computerprogram product according to claim 7, wherein the computer-readableprogram code portions further comprise executable code portions for:receiving the information associated with the resource transfer;generating a second pending data record comprising the informationassociated with the resource transfer; validating the second pendingdata record via a second consensus mechanism; and appending the secondpending data record to a second distributed register implemented on asecond distributed register technology.
 9. The computer program productaccording to claim 8, wherein the first distributed register technologyis different from the second distributed register technology.
 10. Thecomputer program product according to claim 8, wherein the secondnetwork services node is configured to execute a smart contract toautomatically transmit a notification to the first network servicesnode, wherein the notification indicates that the second pending datarecord has been validated by the second network services node.
 11. Thecomputer program product according to claim 7, wherein validating thefirst pending data record comprises performing one or more validationchecks on the information associated with the resource transfer.
 12. Thecomputer program product according to claim 11, wherein the one or morevalidation checks comprises verification of user information and accountinformation.
 13. A computer-implemented method for integration andinteroperability between disparate distributed server technologies,wherein the computer-implemented method comprises: generating, within afirst distributed server network, a pending data record comprising arequest to execute a resource transfer; validating the resource transfervia a first consensus mechanism; appending the pending data record to afirst distributed register implemented on a first distributed registertechnology; and transmitting, via a first network services node,information associated with the resource transfer to a second networkservices node of a second distributed server network.
 14. Thecomputer-implemented method according to claim 13, wherein thecomputer-implemented method further comprises: receiving the informationassociated with the resource transfer; generating a second pending datarecord comprising the information associated with the resource transfer;validating the second pending data record via a second consensusmechanism; and appending the second pending data record to a seconddistributed register implemented on a second distributed registertechnology.
 15. The computer-implemented method according to claim 14,wherein the first distributed register technology is different from thesecond distributed register technology.
 16. The computer-implementedmethod according to claim 14, wherein the second network services nodeis configured to execute a smart contract to automatically transmit anotification to the first network services node, wherein thenotification indicates that the second pending data record has beenvalidated by the second network services node.
 17. Thecomputer-implemented method according to claim 13, wherein validatingthe first pending data record comprises performing one or morevalidation checks on the information associated with the resourcetransfer.
 18. The computer-implemented method according to claim 17,wherein the one or more validation checks comprises verification of userinformation and account information.